Constructive vs Perturbative Local Search for General Integer Linear Programming⋆
نویسندگان
چکیده
Most local search algorithms are “perturbative”, incrementally moving from a search state to a neighbouring state while performing noisy hill-climbing. An alternative form of local search is “constructive”, repeatedly building partial solutions using greedy or other heuristics. Both forms have been combined with constraint propagation, and they can be hybridised with each other by perturbing partial solutions. We design a new hybrid constructive local search algorithm for general (nonbinary) integer linear programs, combining techniques from constraint programming, boolean satisfiability, numerical optimisation and scheduling. On a hard design problem it scales better to large instances than both a perturbative algorithm and a Benders decomposition algorithm.
منابع مشابه
MILP and Max-Clique based heuristics for the Eternity II puzzle
The present paper considers a hybrid local search approach to the Eternity II puzzle and to unsigned, rectangular, edge matching puzzles in general. Both an original mixed-integer linear programming (MILP) formulation and a novel Max-Clique formulation are presented for this NP-hard problem. Although the presented formulations remain computationally intractable for medium and large sized instan...
متن کاملA Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling
This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...
متن کاملLocal Branching in a Constraint Programming Framework
Local branching is a general purpose heuristic method which searches locally around the best known solution by employing tree search. It has been successfully used in Mixed Integer Programming (MIP) where local branching constraints are used to model the neighborhood of an incumbent solution and improve the bound. The neighborhoods are obtained by linear inequalities in the MIP model so that MI...
متن کاملEdge-swapping algorithms for the minimum fundamental cycle basis problem
We consider the problem of finding a fundamental cycle basis with minimum total cost in an undirected graph. This problem is NP-hard and has several interesting applications. Since fundamental cycle bases correspond to spanning trees, we propose a local search algorithm, a tabu search and variable neighborhood search in which edge swaps are iteratively applied to a current spanning tree. We als...
متن کاملA Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with different qualifications and availabilities should be assigned to a set of games already scheduled. We extend and improve a previous three-phase approach for this problem, based on a constructive heuristic, a repair heuristi...
متن کامل